Fault-tolerant meshes and hypercubes with minimal numbers of spares
نویسندگان
چکیده
منابع مشابه
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
Many parallel computers consist of processors connected in the form of a d-dimensional mesh or hypercube. Twoand three-dimensional meshes have been shown to be efficient in manipulating images and dense matrices, whereas hypercubes have been shown to be well suited to divide-andconquer algorithms requiring global communication. However, even a single faulty processor or communication link can s...
متن کاملFault-tolerant meshes with minimal numbers of spares
This paper presents several techniques for adding fault-tolerance t o distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tolerant graph with n + k nodes such that given any set of k or fewer faulty nodes, the remaining graph is guaranteed to contain the target graph as a fault-free subgraph. As a result, any algorithm designed for the targ...
متن کاملAdaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
We present an adaptive deadlock-free routing algorithm which decomposes a given network into two virtual interconnection networks, V IN 1 and V IN 2. V IN 1 supports deterministic deadlock-free routing, and V IN 2 supports fully-adaptive routing. Whenever a channel in V IN 1 or V IN 2 is available, it can be used to route a message. Each node is identiied to be in one of three states: safe, uns...
متن کاملBipartite Crossing Numbers of Meshes and Hypercubes
Let G = (V0; V1; E) be a connected bipartite graph, where V0; V1 is the bipartition of the vertex set V (G) into independent sets. A bipartite drawing of G consists of placing the vertices of V0 and V1 into distinct points on two parallel lines x0 ; x1, respectively, and then drawing each edge with one straight line segment which connects the points of x0 and x1 where the endvertices of the edg...
متن کاملFault-Tolerant Hypercubes with Small Degree
For a given N-vertex graph. H, a graph G obtained from H by adding t vertices a,nd some edges is called a t-FT (t-fault-toleran,t) graph. for H if even after deletin.g any t vertices from G, the remaining graph contains H as a subgraph. For an N-vertex hypercube QN, a t-FT graph with an, optimal number O(tN +t2) of added edges and maximum degree of O(N + t), and a, t-FT graph zuith O(tN log N) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1993
ISSN: 0018-9340
DOI: 10.1109/12.241598